溶胶—凝胶法制备SiO2气凝胶薄膜溶胶粘度的研究

用低介电常数介质薄膜代替传统的SiO2薄膜是减小ULSI中互连延迟、串扰和能耗的有效方法.SiO2气凝胶薄膜因具有低介电常数、低密度、高热稳定性等性能而成为ULSI中金属间介质的理想材料.以正硅酸乙酯为原料,采用酸/碱两步溶胶-凝胶法结合匀胶和超临界干燥等工艺在硅片上成功制备了SiO2气凝胶薄膜.研究了不同配比的SiO2溶胶粘度随时间的变化;确定了适于匀胶的溶胶的粘度范围为9～15mPa*s;发现溶胶粘度在9～15mPa*s的时间随溶剂异丙醇(IPA)用量的增加和NH4OH的减少而延长.     

低地球轨道卫星网络节能方法

通常卫星的唯一能源来源是太阳能,因此星上网络设备的能源供应问题比地面网络的更加严峻。通过修改和扩展链路容量受限的最小代价多商品流模型来适应卫星网络这一特殊的体系结构,并基于低轨道卫星网络的多重覆盖机制和流量分布模型,改进现有的启发式算法来关闭冗余的卫星节点、星地链路和星间链路。在满足链路利用率和路由跳数增加比例约束的条件下,仿真实验中关闭上述三种参数的比例分别可达59%、61%和72%,卫星网络的总体节能比例可达65%。     

Path optimization for the resource‐constrained searcher

We formulate and solve a discrete‐time path‐optimization problem where a single searcher, operating in a discretized three‐dimensional airspace, looks for a moving target in a finite set of cells. The searcher is constrained by maximum limits on the consumption of one or more resources such as time, fuel, and risk along any path. We develop a specialized branch‐and‐bound algorithm for this problem that uses several network reduction procedures as well as a new bounding technique based on Lagrangian relaxation and network expansion. The resulting algorithm outperforms a state‐of‐the‐art algorithm for solving time‐constrained problems and also is the first algorithm to solve multi‐constrained problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

有限数量机载雷达目标覆盖价值算法

针对有限数量机载雷达目标覆盖价值问题,建立了机载雷达载机待选轨道中心点(COCP)概念;分析了COCP和目标点之间的关系,给出了有限数量机载雷达目标覆盖价值问题的数学模型。通过分析有限规模COCP集合的方法,建立了多个机载雷达部署约束条件的数学模型。通过对COCP集合和目标点集合进行约束排除和聚类,简化了研究问题。总结出了有限数量机载雷达目标覆盖价值数学模型的最优解和启发式次优解,实例仿真结果表明该模型和算法的有效性。     

精确制导弹药低成本制导控制系统设计

针对精确制导弹药制导控制系统低成本的迫切需求,提出了一种弹载低成本制导控制系统设计方法。建立了一种弹载制导控制系统低成本体系架构,从功能、硬件、软件等方面对其进行了GNC一体化设计,并在此基础上提出了一种基于ARM处理器的一体化制导计算机设计方法。针对MEMS导航系统精度低、噪声大特点,设计了一种惯性/卫星数字制导方案。该低成本制导控制系统设计方法可有效减少系统冗余硬件,降低成本,实现较高的制导控制精度,满足未来低成本精确制导武器的需求。     

滑模控制的新型双幂次组合函数趋近律

提出一种基于双幂次组合函数趋近律的新型滑模控制方案。与现有的快速幂次或双幂次趋近律相比,具有更快的收敛速度,同时还保持了全局固定时间收敛特性,收敛时间上界与滑模初值无关。当系统存在有界扰动时,能够使滑模变量在有限时间内收敛到稳态误差界内,同时其稳态误差要小于现有方法的。仿真实验验证了该方法的有效性及理论分析的正确性。     

THO-MAC:一种两跳优化的低延迟低功耗无线传感器网络介质访问控制协议

功耗与延迟是无线传感器网络介质访问控制协议设计首要考虑的两个问题。提出了一种新的传感器网络低延迟、低功耗、接收节点初始化异步介质访问控制协议——THO-MAC协议。通过准确预测接收节点的唤醒时间,THO-MAC协议调度发送节点侦听信道,从而减少发送节点空闲侦听能量浪费。THOMAC协议在发送节点两跳转发节点集中选择使报文两跳转发延迟最小的转发节点,从而降低报文传输延迟。使用NS2模拟器对THO-MAC协议进行了详细模拟。模拟结果显示,与RI-MAC和Any-MAC协议相比,THOMAC协议可以减少35.5%和18%的报文传输延迟,同时节省23.5%和15.5%的节点功耗。     

绳系拖曳离轨过程中的摆动抑制策略

以周向常值连续小推力作用下的绳系拖曳离轨为背景,针对离轨过程中的系绳摆动抑制问题,建立了系统质心轨道动力学方程及系绳摆动动力学方程,分析了无系绳收放控制时的系绳摆动特性以及系绳收放对系绳摆动的作用效果,构造了使系绳摆动衰减的期望绳长收放速率并设计了系绳张力控制律。仿真结果表明:无系绳收放控制时,系绳摆动表现为平衡位置附近的周期性往复运动;张力控制连续平滑,很好地实现了系绳实际长度对期望长度的跟踪,同时有效地抑制了离轨过程中的系绳摆动。     

GPS L1C信号LDPC译码器设计

GPS现代化中的L1C信号使用了LDPC码,以提高接收机的弱信号接收能力。L1C信号中使用的LDPC码没有循环或准循环结构,这为译码器设计带来了难度。为了降低译码器实现复杂度,在分析L1C信号LDPC码校验矩阵结构的基础上,通过对校验节点分类和改变变量节点更新方法,提出了一种低存储量和简化译码器控制逻辑的低复杂度译码器结构,并通过仿真验证了译码器译码结果的正确性。     

Analysis of algorithms for two‐stage flowshops with multi‐processor task flexibility

In this article we introduce a 2‐machine flowshop with processing flexibility. Two processing modes are available for each task: namely, processing by the designated processor, and processing simultaneously by both processors. The objective studied is makespan minimization. This production environment is encountered in repetitive manufacturing shops equipped with processors that have the flexibility to execute orders either individually or in coordination. In the latter case, the product designer exploits processing synergies between two processors so as to execute a particular task much faster than a dedicated processor. This type of flowshop environment is also encountered in labor‐intensive assembly lines where products moving downstream can be processed either in the designated assembly stations or by pulling together the work teams of adjacent stations. This scheduling problem requires determining the mode of operation of each task, and the subsequent scheduling that preserves the flowshop constraints. We show that the problem is ordinary NP‐complete and obtain an optimal solution using a dynamic programming algorithm with considerable computational requirements for medium and large problems. Then, we present a number of dynamic programming relaxations and analyze their worst‐case error performance. Finally, we present a polynomial time heuristic with worst‐case error performance comparable to that of the dynamic programming relaxations. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.